|
Papers on Whitehead Method 1. Whitehead
method and Genetic Algorithms (with A.D. Miasnikov). Computational and experimental group
theory, 89-114, Contemp.
Math., 349, Amer. Math. Soc., We describe a genetic
Whitehead's algorithm for finding minimal elements (elements of minimal
length in automorphic orbits) in arbitrary free groups. The classical
Whitehead's algorithm is extremely innefective for free groups of big ranks,
but this genetic version of it works all right. Also we formulate several
mathematical conjectures that came out of our experiments. |